Markowitz portfolio optimization using MOSEK. MOSEK Technical report: TR-2009-2
نویسندگان
چکیده
In this tutorial paper we introduce different approaches to Markowitz portfolio optimization, and we show how to solve such problems in MATLAB, R and Python using the MOSEK optimization toolbox for MATLAB, the Rmosek package, and the MOSEK Python API, respectively. We first consider conic formulations of the basic portfolio selection problem, and we then discuss more advanced models for transaction costs. 1 Markowitz portfolio selection We start by reviewing basic Markowitz portfolio optimization, while introducing the necessary notation used in the remaining tutorial. In Markowitz portfolio selection we optimize a portfolio of assets based on a simple probabilistic model of the stock market. Traditionally we assume that the return of n different assets over time can be modeled as a multivariate random variable r ∈ R with known mean E r = μr and covariance matrix E(r − μr)(r − μr) = Σr, where the mean is a vector, and Σr is the covariance matrix (i.e., μr ∈ R and Σ ∈ R). We have an initial holding of w j dollars of asset j, j = 1, . . . , n and we invest xj dollars in asset j, i.e., after the investment period our portfolio is w + x. The return of our investment is also a random variable, y = r (w + x), with mean value (or expected return) E y = μr (w 0 + x) (1) and variance (or risk) (y −E y) = (w + x)Σr(w + x). (2) In Markowitz portfolio selection, we seek to optimize a trade-off between expected return and risk. ∗MOSEK ApS, Fruebjergvej 3, Box 16, 2100 Copenhagen, Denmark. Email: [email protected]
منابع مشابه
Accelerated gradient methods and dual decomposition in distributed model predictive control
We propose a distributed optimization algorithm for mixed L1/L2-norm optimization based on accelerated gradient methods using dual decomposition. The algorithm achieves convergence rate O( 1 k ), where k is the iteration number, which significantly improves the convergence rates of existing duality-based distributed optimization algorithms that achieve O( 1 k ). The performance of the developed...
متن کاملExploiting Parallel Hardware in Solving Optimization Problems
Making an optimal choice, given a number of possibilities and constraints, is a fundamental problem in economics and engineering. Examples include the optimal choice of a portfolio of stocks, given a budget and diversity requirements; the optimal design of a truss, given certain load requirements; and the determination of an optimal production plan, given the current manufacturing equipment. In...
متن کاملA distributed optimization algorithm with convergence rate O ( 1 k 2 ) for distributed model predictive control ∗
We propose a distributed optimization algorithm for mixedL1/L2-norm optimization based on accelerated gradient methods using dual decomposition. The algorithm achieves convergence rate O( 1 k ), where k is the iteration number, which significantly improves the convergence rates of existing duality-based distributed optimization algorithms that achieve O( 1 k ). The performance of the developed ...
متن کاملA Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures
We present an efficient scenario decomposition algorithm for solving large-scale convex stochastic programming problems that involve a particular class of downside risk measures. The considered risk functionals encompass coherent and convex measures of risk that can be represented as an infimal convolution of a convex certainty equivalent, and include well-known measures, such as conditional va...
متن کاملA computational study of the use of an optimization-based method for simulating large multibody systems
The present work aims at comparing the performance of several quadratic programming (QP) solvers for simulating large-scale frictional rigid-body systems. Traditional time-stepping schemes for simulation of multibody systems are formulated as linear complementarity problems (LCPs) with copositive matrices. Such LCPs are generally solved by means of Lemketype algorithms and solvers such as the P...
متن کامل